Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problemBACH, Eric; BOYAR, Joan; EPSTEIN, Leah et al.Report - Software engineering. 2000, Num 26, pp 1-16, issn 1386-369XArticle

New results on flow time with resource augmentationEPSTEIN, Leah; VAN STEE, Rob.Report - Software engineering. 2000, Num 28, pp 1-12, issn 1386-369XArticle

Competitive queue policies for differentiated servicesAIELLO, William A; MANSOUR, Yishay; RAJAGOPOLAN, S et al.Journal of algorithms (Print). 2005, Vol 55, Num 2, pp 113-141, issn 0196-6774, 29 p.Article

Comparing First-Fit and Next-Fit for online edge coloringEHMSEN, Martin R; FAVRHOLDT, Lene M; KOHRT, Jens S et al.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1734-1741, issn 0304-3975, 8 p.Article

Reducing off-line to on-line: An example and its applicationsDEMANGE, Marc.Yugoslav journal of operations research. 2003, Vol 13, Num 1, pp 3-24, issn 0354-0243, 22 p.Article

On the Bahncard problemFLEISCHER, Rudolf.Theoretical computer science. 2001, Vol 268, Num 1, pp 161-174, issn 0304-3975Conference Paper

Online request server matchingRIEDEL, Marco.Theoretical computer science. 2001, Vol 268, Num 1, pp 145-160, issn 0304-3975Conference Paper

Compositional competitiveness for distributed algorithmsASPNES, James; WAARTS, Orli.Journal of algorithms (Print). 2005, Vol 54, Num 2, pp 127-151, issn 0196-6774, 25 p.Article

A theoretical comparison of LRU and LRU-KBOYAR, Joan; EHMSEN, Martin R; KOHRT, Jens S et al.Acta informatica. 2010, Vol 47, Num 7-8, pp 359-374, issn 0001-5903, 16 p.Article

Trackless online algorithms for the server problemBEIN, W. W; LARMORE, L. L.Information processing letters. 2000, Vol 74, Num 1-2, pp 73-79, issn 0020-0190Article

A risk-reward model for the on-line leasing of depreciable equipmentYONG ZHANG; WEIGUO ZHANG; WEIJUN XU et al.Information processing letters. 2011, Vol 111, Num 6, pp 256-261, issn 0020-0190, 6 p.Article

Deadline scheduling and power management for speed bounded processorsXIN HAN; LAM, Tak-Wah; LEE, Lap-Kei et al.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3587-3600, issn 0304-3975, 14 p.Article

Dynamic TCP acknowledgment with sliding windowKOGA, Hisashi.Theoretical computer science. 2009, Vol 410, Num 8-10, pp 914-925, issn 0304-3975, 12 p.Article

On the k-orientability of random graphsDEVROYE, Luc; MALALLA, Ebrahim.Discrete mathematics. 2009, Vol 309, Num 6, pp 1476-1490, issn 0012-365X, 15 p.Article

Competitive analysis of most-request-first for scheduling broadcasts with start-up delayHUNG, Regant Y. S; TING, H. F.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 200-211, issn 0304-3975, 12 p.Article

Scheduling to maximize participationCARAGIANNIS, Loannis; KAKLAMANIS, Christos; KANELLOPOULOS, Panagiotis et al.Theoretical computer science. 2008, Vol 402, Num 2-3, pp 142-155, issn 0304-3975, 14 p.Article

New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor schedulingCHAN, Wun-Tat; LAM, Tak-Wah; LIU, Kin-Shing et al.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 430-439, issn 0304-3975, 10 p.Article

Analysis of queueing policies in QoS switchesAN ZHU.Journal of algorithms (Print). 2004, Vol 53, Num 2, pp 137-168, issn 0196-6774, 32 p.Article

Optimal online algorithms for minimax resource schedulingHUNSAKER, Brady; KLEYWEGT, Anton J; SAVELSBERGH, Martin W. P et al.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 4, pp 555-590, issn 0895-4801, 36 p.Article

A decomposition theorem for task systems and bounds for randomized server problemsBLUM, Avrim; KARLOFF, Howard; RABANI, Yuval et al.SIAM journal on computing (Print). 2001, Vol 30, Num 5, pp 1624-1661, issn 0097-5397Article

The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problemsYING TEH TSAI; CHUAN YI TANG.Information processing letters. 1993, Vol 48, Num 4, pp 177-182, issn 0020-0190Article

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric caseCICALESE, Ferdinando; GAGIE, Travis; LABER, Eduardo et al.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1070-1078, issn 0166-218X, 9 p.Article

Online rectangle fillingHAITAO WANG; CHAUDHARY, Amitabh; CHEN, Danny Z et al.Theoretical computer science. 2011, Vol 412, Num 39, pp 5247-5275, issn 0304-3975, 29 p.Article

Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraintMING LIU; FEIFENG ZHENG; CHENGBIN CHU et al.Theoretical computer science. 2011, Vol 412, Num 39, pp 5225-5231, issn 0304-3975, 7 p.Article

Improved randomized results for the interval selection problemEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3129-3135, issn 0304-3975, 7 p.Article